Failure Detection in Message Passing Systems
نویسنده
چکیده
منابع مشابه
A Progressive Fault Tolerant Mechanism in Mobile Agent Systems
We present the approach of deploying cooperating agents to detect failures as well as recover services in a mobile agent system. In additional to server failure detection, we use cooperating agents to handle agent failure detection. Two types of agents are involved. One is the agent performing the computation delegated by the owner, which we call the actual agent. Another is the agent that moni...
متن کاملThe Minimum Failure Detector For Non-Local Tasks In Message-Passing Systems
Intuitively, a task is local if the output value of each process depends only on the process’ own input value, not on the input values of the other processes; a task is non-local otherwise. In this paper, we use the failure detector abstraction to determine the minimum information about failures that is necessary to solve non-local tasks in message-passing systems. More precisely, we show that ...
متن کاملTermination Detection in an Asynchronous Distributed System with Crash-Recovery Failures
We revisit the problem of detecting the termination of a distributed application in an asynchronous message-passing model with crash-recovery failures and failure detectors. We derive a suitable definition of termination detection in this model but show that this definition is impossible to implement unless you have a failure detector which can predict the future. We subsequently weaken the pro...
متن کاملApplication Resilience with Process Failures (1)
The notion of resiliency is concerned with constructing mission-critical applications that are able to operate through a wide variety of failures, errors, and malicious attacks. A number of approaches have been proposed in the literature based on fault tolerance achieved through replication of resources. In general, these approaches provide graceful degradation of performance to the point of fa...
متن کاملBrief Announcement: Sharing Memory in a Self-stabilizing Manner
Introduction. A core abstraction for many distributed algorithms simulates shared memory [3]; this abstraction allows to take algorithms designed for shared memory, and port them to asynchronous message-passing systems, even in the presence of failures. There has been significant work on creating such simulations, under various types of permanent failures, as well as on exploiting this abstract...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996